Encoding range minima and range top-2 queries
نویسندگان
چکیده
منابع مشابه
Encoding range minima and range top-2 queries.
We consider the problem of encoding range minimum queries (RMQs): given an array A[1..n] of distinct totally ordered values, to pre-process A and create a data structure that can answer the query RMQ(i,j), which returns the index containing the smallest element in A[i..j], without access to the array A at query time. We give a data structure whose space usage is 2n+o(n) bits, which is asymptoti...
متن کاملEncoding Two-Dimensional Range Top-k Queries
We consider various encodings that support range Top-k queries on a two-dimensional array containing elements from a total order. For an m × n array, with m ≤ n, we first propose an almost optimal encoding for answering one-sided Top-k queries, whose query range is restricted to [1 . . .m][1 . . . a], for 1 ≤ a ≤ n. Next, we propose an encoding for the general Top-k queries that takes m2 lg ((k...
متن کاملEncoding Range Minimum Queries
We consider the problem of encoding range minimum queries (RMQs): given an array A[1..n] of distinct totally ordered values, to pre-process A and create a data structure that can answer the query RMQ(i, j), which returns the index containing the smallest element in A[i..j], without access to the array A at query time. We give a data structure whose space usage is 2n + o(n) bits, which is asympt...
متن کاملI/O-Efficient Range Minima Queries
In this paper we study the offline (batched) range minima query (RMQ) problem in the external memory (EM) and cache-oblivious (CO) models. In the static RMQ problem, given an array A, a query rmqA(i, j) returns the smallest element in the range A[i, j]. IfB is the size of the block andm is the number of blocks that fit in the internal memory in the EM and CO models, we show that Q range minima ...
متن کاملEncoding 2D Range Maximum Queries
We consider the two-dimensional range maximum query (2DRMQ) problem: given an array A of ordered values, to pre-process it so that we can find the position of the largest element in a (user-specified) range of rows and range of columns. We focus on determining the effective entropy of 2D-RMQ, i.e., how many bits are needed to encode A so that 2D-RMQ queries can be answered without access to A. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences
سال: 2014
ISSN: 1364-503X,1471-2962
DOI: 10.1098/rsta.2013.0131